Augmenting and preserving partition connectivity of a hypergraph
نویسندگان
چکیده
Let k be a positive integer. A hypergraphH is k-partition-connected if for every partition P of V (H), there are at least k(|P |−1) hyperedges intersecting at least two classes of P . In this paper, we determine the minimum number of hyperedges in a hypergraph whose addition makes the resulting hypergraph k-partition-connected. We also characterize the hyperedges of a k-partition-connected hypergraph whose removal will preserve k-partition-connectedness.
منابع مشابه
Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
Given a hypergraph, a partition of its vertex set and an integer k, find a minimum number of graph edges to be added between different members of the partition in order to make the hypergraph k-edge-connected. This problem is a common generalization of the following two problems: edge-connectivity augmentation of graphs with partition constraints (J. Bang-Jensen, H. Gabow, T. Jordán, Z. Szigeti...
متن کاملEdge-connectivity of permutation hypergraphs
In this note we provide a generalization of a result of Goddard, Raines and Slater [4] on edge-connectivity of permutation graphs for hypergraphs. A permutation hypergraph Gπ is obtained from a hypergraph G by taking two disjoint copies of G and by adding a perfect matching between them. The main tool in the proof of the graph result was the theorem on partition constrained splitting off preser...
متن کاملHypergraph connectivity augmentation
The hypergraph augmentation problem is to augment a hypergraph by hyperedges to meet prescribed local connectivity requirements. We provide here a minimax theorem for this problem. The result is derived from the degree constrained version of the problem by a standard method. We shall construct the required hypergraph for the latter problem by a greedy type algorithm. A similar minimax result wi...
متن کاملA note on hypergraph connectivity augmentation
We prove an abstract version of an edge-splitting theorem for directed hypergraphs that appeared in [1], and use this result to obtain min-max theorems on hypergraph augmentation problems that are linked to orientations. These problems include (k, l)-edge-connectivity augmentation of directed hypergraphs, and (k, l)-partition-connectivity augmentation of undirected hypergraphs by uniform hypere...
متن کاملAugmenting Hypergraphs to Meet Local Connectivity Requirements
We consider aspects of vertex splitting and connectivity augmentation in hypergraphs. In the splitting problem we are given a hypergraph G = (V + s, E) in which s is only incident with edges of size two and asked to “split” s in such a way that we preserve the local-connectivity in the set V . We develop results that lead to a characterisation of the hypergraphs in which there is no such split....
متن کامل